On Evaluating Decision Procedures for Modal Logic

نویسندگان

  • Ullrich Hustadt
  • Renate A. Schmidt
چکیده

This paper investigates the evaluation method of decision procedures for multi-modal logic proposed by Giunchiglia and Sebastiani as an adaptation from the evaluation method of Mitchell et al of decision procedures for propositional logic. We compare three dif­ ferent theorem proving approaches, namely the Davis-Putnam-based procedure KSAT, the tableaux-based system KTUS and a transla­ tion approach combined with first-order resolu­ tion. Our results do not support the claims of Giunchiglia and Sebastiani concerning the com­ putational superiority of KSAT over KRIS, and an easy-hard-easy pattern for randomly gener­ ated modal formulae.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Optimised Decision Procedures for Propositional Modal K(m) Satis ability

Heavily-optimised decision procedures for propositional modal satisability are now becoming available. Two systems incorporating such procedures for modal K, Dlp and KsatC, are tested on randomly-generated CNF formulae with several sets of parameters, varying the maximum modal depth and ratio of propositional variable to modal subformulae. The results show some easy-hard-easy behaviour, but the...

متن کامل

Incremental Decision Procedures for Modal Logic with Nominals and Eventualities

This thesis contributes to the study of incremental decision procedures for modal logics with nominals and eventualities. Eventualities are constructs that allow to reason about the reflexive-transitive closure of relations. Eventualities are an essential feature of temporal logics and propositional dynamic logic (PDL). Nominals extend modal logics with the possibility to reason about state equ...

متن کامل

Resolution based decision procedures for subclasses of first-order logic

This thesis studies decidable fragments of first-order logic which are relevant to the field of nonclassical logic and knowledge representation. We show that refinements of resolution based on suitable liftable orderings provide decision procedures for the subclasses E+, K, and DK of firstorder logic. By the use of semantics-based translation methods we can embed the description logic ALB and e...

متن کامل

Generating Hard Modal Problems for Modal Decision Procedures

Random generation of modal formulae is a viable method for generating problems for benchmarking modal decision procedures. However, previous work in this area has used a flawed generator that has resulted in questionable results. Fixing the generator changes the characteristics of the generated problems. The fixed generator can be used to generate hard problems that have more interesting modal ...

متن کامل

Modal Satisfiability via SMT Solving

Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT and SMT solvers. Soundness, completeness, and termination of the procedures can be proved in a uniform and elementa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997